Triangulating a Plane
نویسندگان
چکیده
In this theoretical paper we consider the problem of accurately triangulating a scene plane. Rather than first triangulating a set of points and then fitting a plane to these points, we try to minimize the back-projection errors as functions of the plane parameters directly. As this is both geometrically and statistically meaningful our method performs better than the standard two step procedure. Furthermore, we show that the error residuals of this formulation are quasiconvex thereby making it very easy to solve using for example standard local optimization methods.
منابع مشابه
Triangulating the Real Projective Plane
We consider the problem of computing a triangulation of the real projective plane P , given a finite point set P = {p1, p2, . . . , pn} as input. We prove that a triangulation of P always exists if at least six points in P are in general position, i.e., no three of them are collinear. We also design an algorithm for triangulating P if this necessary condition holds. As far as we know, this is t...
متن کاملWeinberg bounds over nonspherical graphs
Let G Aut and E G denote the automorphism group and the edge set of a graph G, respectively. Weinberg’s Theorem states that 4 is a constant sharp upper bound on the ratio G E G Aut over planar (or spherical) 3-connected graphs G. We have obtained various analogues of this theorem for nonspherical graphs, introducing two Weinberg-type bounds for an arbitrary closed surfa...
متن کاملA Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons
Seidel, R., A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons, Computational Geometry: Theory and Applications 1 (1991) 51-64. This paper presents a very simple incremental randomized algorithm for computing the trapezoidal decomposition induced by a set S of n line segments in the plane. If S is given as a simple polygona...
متن کاملComputing convex quadrangulations☆
We use projected Delaunay tetrahedra and a maximum independent set approach to compute large subsets of convex quadrangulations on a given set of points in the plane. The new method improves over the popular pairing method based on triangulating the point set.
متن کاملEfficient Geometric Algorithms on the EREW PRAM
We present a technique that can be used to obtain efficient parallel algorithms in the EREW-PRAM computational model. This technique enables us to optimally solve a number of geometric problems in O(logn) time using O(n/logn) EREW-PRAM processors, where n is the input size. These problerns include: computing the convex hull oCa sorted point set in the plane, computing the convex hull oCa simple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011